Universally Balanced Combinatorial Optimization Games
نویسندگان
چکیده
منابع مشابه
Universally Balanced Combinatorial Optimization Games
This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivis...
متن کاملProduction-inventory games: A new class of totally balanced combinatorial optimization games
In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation among agents is given by sharing production processes and warehouse facilities: agents in a coalition ...
متن کاملOn some approximately balanced combinatorial cooperative games
A model of taxation for cooperative n-person games is introduced where proper coalitions are taxed proportionally to their value. Games with non-empty core under taxation at rate e are a-balanced. Sharp bounds on e in matching games on (not necessarily bipartite) graphs are established. Upper and lower bounds on the smallest e in bin packing games are derived and euclidean random TSP games are ...
متن کاملUniversally balanced photonic interferometers.
A new general class of optical interferometers is proposed, and the physical principle of their operation is explained. They split the spectrum entering one input port among the interferometer arms in an arbitrarily chosen wavelength- and/or time-dependent manner but guarantee broadband constructive interference into a single output port by symmetry. The design relies only on time reversibility...
متن کاملSecurity Games and Combinatorial Optimization
• Set of defender pure strategies, denoted as E . We will use e(∈ E) to denote a generic pure strategy. Crucially, any e can be viewed as a subset of [n], denoting the protected (a.k.a., covered) targets by this pure strategy. In particular, the defender has multiple security resources; One pure strategy is a feasible allocation of these resources – e is precisely the set of covered targets in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games
سال: 2010
ISSN: 2073-4336
DOI: 10.3390/g1030299